Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

w(r(x)) → r(w(x))
b(r(x)) → r(b(x))
b(w(x)) → w(b(x))

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

w(r(x)) → r(w(x))
b(r(x)) → r(b(x))
b(w(x)) → w(b(x))

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:
b1 > w1 > r1

Status:
r1: multiset
b1: [1]
w1: [1]